Quantum mechanics tells us that states involving indistinguishable fermions must be antisymmetrized. This is often taken to mean that indistinguishable fermions are always entangled. We consider several notions of entanglement and argue that on the best of them, indistinguishable fermions are not always entangled. We also present a simple but unconventional way of representing fermionic states that allows us to maintain a link between entanglement and non-factorizability.

Ladyman, Presnell, and Short proposed a model of the implementation of logical operations by physical processes in order to clarify the exact statement of Landauer's Principle, and then offered a new proof of the latter based on the construction of a thermodynamic cycle, arguing that if Landauer's Principle were false it would be possible to harness a machine that violated it to produce a violation of the second law of thermodynamics. In a recent paper in this journal, John Norton directly (...) challenges the consistency of that proof. In the present paper we defend the proof given by Ladyman et al. against his critique. In particular, contrary to what Norton claims, we argue that the processes used in the proof cannot be used to construct a cycle that enacts erasure in a thermodynamically reversible way, and that he does not show that the processes used in the proof violate the Second Law of Thermodynamics. (shrink)

Realism about computation is the view that whether or not a particular physical system is performing a particular computation is at least sometimes a mindindependent feature of reality. The caveat ’at least sometimes’ is necessary here because a realist about computation need not believe that all instances of computation should be realistically construed. The computational theory of mind presupposes realism about computation. If whether or not the human nervous system implements particular computations is not a natural fact about the world (...) that is independent of whether we represent it as doing so, then the computational theory of mind fails to naturalise the mind. Realism about computation is also presupposed by attempts to use computational principles such as Landauer’s Principle to dispel Maxwell’s Demon. Realism about computation has been challenged by Hilary Putnam and John Searle among others. Various arguments have been put forward purporting to show that any physical system of sufficient complexity trivially implements all computations. Ladyman et al. offer a precisification and general proof Landauer’s Principle. In order to do this they present an analysis of what it is for a physical process to implement a logical transformation. In this paper, their analysis is explained and its implications for realism about computation and the use of Landauer’s Principle in foundational debates is assessed. (shrink)